Index Sets and Boolean Operations
نویسندگان
چکیده
منابع مشابه
Boolean Algebras, Tarski Invariants, and Index Sets
Tarski defined a way of assigning to each boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from N, such that two boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean al...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملTopology-Oriented Boolean Operations
This technical report discusses an efficient, topologyoriented method for Boolean operations on polyhedral manifolds. A new spatial hashing technique is proposed for detecting intersections of primitive pairs in linear time complexity. A topology-oriented technique is proposed that classifies the type of intersection using robust geometric predicates. Boolean results are built using finite-prec...
متن کاملpropagation models and fitting them for the boolean random sets
in order to study the relationship between random boolean sets and some explanatory variables, this paper introduces a propagation model. this model can be applied when corresponding poisson process of the boolean model is related to explanatory variables and the random grains are not affected by these variables. an approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملOperations, sets and classes
Operational set theory, in the form described below, is an enterprise which consolidates classical set theory with some central concepts of Feferman’s explicit mathematics. It provides for a careful distinction between operations and set-theoretic functions and as such reconciles set theory with needs arising in constructive environments and even in those enhanced by computer science. In the fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1982
ISSN: 0002-9939
DOI: 10.2307/2044037